A MAP Overhead Aware Two-Dimensional OFDMA Burst Construction Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Increasing the VoIP Capacity through MAP Overhead Reduction in the IEEE 802.16 OFDMa Systems

One of the main issues with supporting VoIP service over 802.16 networks is the signalling overhead caused by the downlink MAP messages due to frequent transmissions and small packets. To decrease the MAP overhead, the 802.16 standard proposes some mechanisms, such as the compressed MAP and sub-MAPs. In this paper, we show by means of extensive dynamic simulations that sub-MAPs can reduce drama...

متن کامل

Overhead-Aware-Best-Fit (OABF) Resource Allocation Algorithm for Minimizing VM Launching Overhead

FermiCloud is a private cloud developed in Fermi National Accelerator Laboratory to provide elastic and on-demand resources for different scientific research experiments. The design goal of the FermiCloud is to automatically allocate resources for different scientific applications so that the QoS required by these applications is met and the operational cost of the FermiCloud is minimized. Our ...

متن کامل

Iterated Monodromy for a Two-Dimensional Map

We compute the iterated monodromy group for a postcritically finite endomorphism F of P. The postcritical set is the union of six lines, and the wreath recursion for the group closely reflects the dynamics of F on these lines.

متن کامل

A Review Paper on Burst Scheduling Algorithm for Wimax Ofdma System

Worldwide interoperability for Microwave Access (WiMAX) is a Broad Band Wireless Access (BWA) technology. It provides high data rates and multimedia services. It also supports Quality of Services (QoS) for various types of application. When large number of users use these application, the OFDMA is used to divide the channel into several subchannels and those subchannel can be provided for diffe...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Sciences

سال: 2019

ISSN: 2076-3417

DOI: 10.3390/app9020354